A Multicast Routing Scheme for the Internet: Simulation and Experimentation in Large-Scale Networks

With the globalisation of multimedia entertainment industry and popularity streaming content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In 1990’s, received great deal attention from research community; nevertheless, its main problems still remain mostly unaddressed do not reach acceptance level required for wide deployment. Among other reasons, scaling limitation relative complexity standard protocol architecture can be attributed to conventional approach overlaying on top unicast topology. this paper, we present Greedy Compact Multicast Routing (GCMR) scheme. GMCR characterised by scalable independence any addressing schemes; more specifically, local knowledge cost direct neighbour nodes enough GCMR scheme properly operate. The branches tree are constructed directly joining destination which acquire information needed source means an incremental two-stage search process. paper details evaluate performance in terms size (i.e., stretch), memory space consumption, communication cost, transmission cost. comparative analysis performed against one reference algorithm two well-known standards. Both simulation emulation results show that achieves expected objectives provide guidelines further improvements.